Computation with classical sequents
نویسندگان
چکیده
منابع مشابه
Computation with classical sequents
X is an untyped continuation-style formal language with a typed subset which provides a Curry-Howard isomorphism for a sequent calculus for implicative classical logic. X can also be viewed as a language for describing nets by composition of basic components connected by wires. These features make X an expressive platform on which algebraic objects and many different (applicative) programming p...
متن کاملClassical Sequents and Computation : An overview
This paper presents a short overview of some of the results achieved for the calculus X , which is based on Gentzen’s lk. It presents the calculus, its suitability for encoding the λcalculus and the λμ-calculus, as well as a type-preserving encoding of X into the π-calculus.
متن کاملCLASSICAL SEQUENTS AND COMPUTATION : AN OVERVIEW To Henk Barendregt, in honour of his 60th birthday
This paper presents a short overview of some of the results achieved for the calculus X , which is based on Gentzen’s LK. It presents the calculus, its suitability for encoding the λ-calculus and the λμ-calculus, as well as a type-preserving encoding of X into the π-calculus.
متن کاملClassical and non-classical computation
supportive in the design process. For this to be possible, computation must be understood in a broad sense, encompassing both the narrow, digital kind of computation and the more general kind of computation in which objects may only have digital approximations. It is this broad approach that we have adopted. The aspects of computation considered here are representation and process. Representati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2008
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129508006762